The Vertex-gutman Index of k-Caterpillars with Equal Length Hairs
نویسندگان
چکیده
منابع مشابه
Bounds on Gutman Index
The Gutman index (also known as Schultz index of the second kind) of a graph G is defined as Gut(G) = ∑ u,v∈V (G) d(u)d(v)d(u, v). We show that among all graphs on n vertices, the star graph Sn has minimal Gutman index. In addition, we present upper and lower bounds on Gutman index for graphs with minimal and graphs with maximal Gutman index. Corresponding author Supported by project 1M0545 of ...
متن کاملOn the harmonic index and harmonic polynomial of Caterpillars with diameter four
The harmonic index H(G) , of a graph G is defined as the sum of weights 2/(deg(u)+deg(v)) of all edges in E(G), where deg (u) denotes the degree of a vertex u in V(G). In this paper we define the harmonic polynomial of G. We present explicit formula for the values of harmonic polynomial for several families of specific graphs and we find the lower and upper bound for harmonic index in Caterpill...
متن کاملArbitrarily vertex decomposable caterpillars with four or five leaves
A graph G of order n is called arbitrarily vertex decomposable if for each sequence (a1, . . . , ak) of positive integers such that a1+. . .+ak = n there exists a partition (V1, . . . , Vk) of the vertex set of G such that for each i ∈ {1, . . . , k}, Vi induces a connected subgraph of G on ai vertices. D. Barth and H. Fournier showed that if a tree T is arbitrarily vertex decomposable, then T ...
متن کاملComputing Vertex PI Index of Tetrathiafulvalene Dendrimers
General formulas are obtained for the vertex Padmakar-Ivan index (PIv) of tetrathiafulvalene (TTF) dendrimer, whereby TTF units we are employed as branching centers. The PIv index is a Wiener-Szeged-like index developed very recently. This topological index is defined as the summation of all sums of nu(e) and nv(e), over all edges of connected graph G.
متن کاملOn the extremal total irregularity index of n-vertex trees with fixed maximum degree
In the extension of irregularity indices, Abdo et. al. [1] defined the total irregu-larity of a graph G = (V, E) as irrt(G) = 21 Pu,v∈V (G) du − dv, where du denotesthe vertex degree of a vertex u ∈ V (G). In this paper, we investigate the totalirregularity of trees with bounded maximal degree Δ and state integer linear pro-gramming problem which gives standard information about extremal trees a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DEStech Transactions on Computer Science and Engineering
سال: 2018
ISSN: 2475-8841
DOI: 10.12783/dtcse/amms2018/26192